On sufficient spectral radius conditions for hamiltonicity

نویسندگان

چکیده

During the last decade several research groups have published results on sufficient conditions for hamiltonicity of graphs in terms their spectral radius and signless Laplacian radius. Here we extend some these results. All our involve characterization exceptional graphs, i.e., all nonhamiltonian that satisfy condition. The proofs main are based Bondy–Chvátal closure, a degree sequence condition due to Chvátal, an operation edges is known as Kelmans’ transformation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient Spectral Conditions for Hamiltonicity

The question of deciding whether or not a given graph is Hamiltonian is a very difficult one; indeed, determining whether a given graph is Hamiltonian is NP-complete. Here, we discuss applications of spectral graph theory to this problem. In particular, we explore results by Fiedler and Nikiforov [2] regarding spectral conditions on the adjacency matrix to ensure Hamiltonicity, and results by B...

متن کامل

Sufficient conditions for Hamiltonicity in multiswapped networks

OTIS networks are interconnection networks amenable to deployment as hybrid networks containing both electronic and optical links. Deficiencies as regards symmetry led to the subsequent formulation of biswapped networks which were later generalized to multiswapped networks so as to still enable optoelectronic implementation (as it happens, multiswapped networks also generalize previously studie...

متن کامل

Spectral radius and Hamiltonicity of graphs with large minimum degree

We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. Let G be a graph of order n and λ (G) be the spectral radius of its adjacency matrix. One of the main results of the paper is the following theorem: Let k 2, n k3 + k + 4, and let G be a graph of order n, with minimum degree δ (G) k. If λ (G) n k 1, then G has a Hamiltonian cycle, unless G = K1 _ (Kn k...

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

On spectral radius of strongly connected digraphs

 It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2021

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2020.01.031